全文获取类型
收费全文 | 515篇 |
免费 | 70篇 |
国内免费 | 15篇 |
专业分类
化学 | 15篇 |
力学 | 11篇 |
综合类 | 4篇 |
数学 | 439篇 |
物理学 | 131篇 |
出版年
2023年 | 7篇 |
2022年 | 7篇 |
2021年 | 16篇 |
2020年 | 14篇 |
2019年 | 19篇 |
2018年 | 14篇 |
2017年 | 22篇 |
2016年 | 16篇 |
2015年 | 13篇 |
2014年 | 40篇 |
2013年 | 45篇 |
2012年 | 29篇 |
2011年 | 23篇 |
2010年 | 18篇 |
2009年 | 35篇 |
2008年 | 32篇 |
2007年 | 27篇 |
2006年 | 29篇 |
2005年 | 19篇 |
2004年 | 11篇 |
2003年 | 18篇 |
2002年 | 17篇 |
2001年 | 9篇 |
2000年 | 20篇 |
1999年 | 14篇 |
1998年 | 9篇 |
1997年 | 12篇 |
1996年 | 9篇 |
1995年 | 3篇 |
1994年 | 11篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1974年 | 1篇 |
1973年 | 2篇 |
排序方式: 共有600条查询结果,搜索用时 15 毫秒
1.
The large deviation principle (LDP) which has been effectively used in queueing analysis is the sample path LDP, the LDP in a function space endowed with the uniform topology. Chang [5] has shown that in the discrete-time G/D/1 queueing system under the FIFO discipline, the departure process satisfies the sample path LDP if so does the arrival process. In this paper, we consider arrival processes satisfying the LDP in a space of measures endowed with the weak* topology (Lynch and Sethuraman [12]) which holds under a weaker condition. It is shown that in the queueing system mentioned above, the departure processes still satisfies the sample path LDP. Our result thus covers arrival processes which can be ruled out in the work of Chang [5]. The result is then applied to obtain the exponential decay rate of the queue length probability in an intree network as was obtained by Chang [5], who considered the arrival process satisfying the sample path LDP. 相似文献
2.
Hidetaka Tobita 《Journal of Polymer Science.Polymer Physics》2004,42(14):2801-2812
The matrix formula developed in the context of heterochain theory, M?w = M?wp + WF ( I ? M )?1 S , was applied to describe the molecular weight development during free‐radical multicomponent polymerization. All of the required probabilistic parameters are expressed in terms of the kinetic‐rate constants and the various concentrations associated with them. In free‐radical polymerization, the number of heterochain types, N, needs to be extrapolated to infinity, and such extrapolation is conducted with only three different N values. This matrix formula can be used as a benchmark test if other approximate approaches can give reasonable estimates of the weight‐average molecular weights. The moment equations with the average pseudo‐kinetic‐rate constants for branching and crosslinking reactions may provide poor estimates when the copolymer composition drift during polymerization is very significant. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 2801–2812, 2004 相似文献
3.
Yang Woo Shin 《Operations Research Letters》2004,32(4):364-373
We consider a single server queue with disasters where the arrivals of customers and disasters are correlated. When a disaster occurs, it removes all the customers in the system and there requires repair time for the system to be operated normally. The stationary queue length distribution at the embedded points and at an arbitrary time are presented. 相似文献
4.
5.
Xuyang Lou 《Journal of Mathematical Analysis and Applications》2007,328(1):316-326
In this paper, the problem of stochastic stability for a class of time-delay Hopfield neural networks with Markovian jump parameters is investigated. The jumping parameters are modeled as a continuous-time, discrete-state Markov process. Without assuming the boundedness, monotonicity and differentiability of the activation functions, some results for delay-dependent stochastic stability criteria for the Markovian jumping Hopfield neural networks (MJDHNNs) with time-delay are developed. We establish that the sufficient conditions can be essentially solved in terms of linear matrix inequalities. 相似文献
6.
Tsuyoshi Katayama 《Queueing Systems》1992,11(3):299-306
This paper derives a conservation law for mean waiting times in a single-server multi-class service queueing system (M
X/G/1 type queue) with setup times which may be dependent on multiple customer classes and its arrival batch size by using the work decomposition property in the queueing system with vacations. 相似文献
7.
We consider a retrial queue with a finite buffer of size N, with arrivals of ordinary units and of negative units (which cancel one ordinary unit), both assumed to be Markovian arrival
processes. The service requirements are of phase type. In addition, a PHL,N bulk service discipline is assumed. This means that the units are served in groups of size at least L, where 1≤ L≤ N. If at the completion of a service fewer than L units are present at the buffer, the server switches off and waits until the buffer length reaches the threshold L. Then it switches on and initiates service for such a group of units. On the contrary, if at the completion of a service
L or more units are present at the buffer, all units enter service as a group. Units arriving when the buffer is full are not
lost, but they join a group of unsatisfied units called “orbit”. Our interest is in the continuous-time Markov chain describing
the state of the queue at arbitrary times, which constitutes a level dependent quasi-birth-and-death process. We start by
analyzing a simplified version of our queueing model, which is amenable to numerical calculation and is based on spatially
homogeneous quasi-birth-and-death processes. This leads to modified matrix-geometric formulas that reveal the basic qualitative
properties of our algorithmic approach for computing performance measures.
AMS Subject Classification: Primary 60K25 Secondary 68M20 90B22. 相似文献
8.
带到达时间的单机排序中的资源分配问题 总被引:1,自引:0,他引:1
讨论两个单机排序的资源分配问题1|rj,pj=bj-ajuj,Cmax≤|∑uj和1|rj,prec,pj=bj-ajuj C max≤|∑uj并给出求其最优资源分配的多项式算法. 相似文献
9.
Mieko Tanaka-Yamawaki 《Annals of the Institute of Statistical Mathematics》2003,55(2):437-446
Contrary to the common sense in economics and financial engineering, price fluctuations at very fine level of motion exhibit
various evidences against the efficient market hypothesis. We attempt to investigate this issue by studying extensive amount
of foreign currency exchange data for over five years at the finest level of resolution. We specifically focus on the proposed
stability in binomial conditional probabilities originally found in much smaller examples of financial time series. In order
to handle very large data, we have written an efficient program in C that automatically generates those conditional probabilities.
It is found that the stability is maintained for extremely large time duration that covers almost the entire period. Based
on the length of conditions for which the conditional probabilities are distinguishable each other, we identify the length
of memory being less than 3 movements. 相似文献
10.
El Kebir Boukas Peng Shi Sing Kiong Nguang 《Journal of Mathematical Analysis and Applications》2003,282(1):241-255
This paper studies the problem of stochastic stability and disturbance attenuation for a class of linear continuous-time uncertain systems with Markovian jumping parameters. The uncertainties are assumed to be nonlinear and state, control and external disturbance dependent. A sufficient condition is provided to solve the above problem. An H∞ controller is designed such that the resulting closed-loop system is stochastically stable and has a disturbance attenuation γ for all admissible uncertainties. It is shown that the control law is in terms of the solutions of a set of coupled Riccati inequalities. A numerical example is included to demonstrate the potential of the proposed technique. 相似文献